Sequent calculus as a compiler intermediate language
نویسندگان
چکیده
منابع مشابه
Source Language Intermediate Language Target Language Compiler
We present a paradigm for proving the correctness of compilers for languages with parallelism. The source language is given a denotational semantics as a compositional translation to a higher-order process calculus. The target language is also given a denotational semantics as a compositional translation to the same process calculus. We show the compiler is correct in that it preserves denotati...
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not immediatel...
متن کاملCompiler architecture using a portable intermediate language
The back end of a compiler performs machine-dependent tasks and lowlevel optimisations that are laborious to implement and difficult to debug. In addition, in languages that require run-time services such as garbage collection, the back end must interface with the run-time system to provide those services. The net result is that building a compiler back end entails a high implementation cost. I...
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not well-suite...
متن کاملA Typed Functional Language Based on Sequent Calculus
SEQUEL is a new functional language that allows the speciication of types within a notation derived from the sequent calculus. Using a synthesis of techniques drawn from both logic and functional programming; types speciied in sequent calculus notation are compiled to programs that enable eecient type-checking of SEQUEL programs. The power of the SEQUEL's type notation enables types to be deene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2016
ISSN: 0362-1340,1558-1160
DOI: 10.1145/3022670.2951931